PALM: Predicting Internet Network Distances Using Peer-to-Peer Measurements

نویسندگان

  • Li-wei Lehman
  • Steven Lerman
چکیده

Landmark-based architecture has been commonly adopted in the networking community as a mechanism to measure and characterize a host’s location on the Internet. In most existing landmark based approaches, end hosts use the distance measurements to a common, fixed set of landmarks to derive an estimated location on the Internet. This paper investigates whether it is possible for participating peer nodes in an overlay network to collaboratively construct an accurate geometric model of its topology in a completely decentralized peer-to-peer fashion, without using a fixed set of landmarks. We call such a peer-to-peer approach in topology discovery and modeling using landmarks PALM (Peers As LandMarks). We evaluate the performance characteristics of such a decentralized coordinates-based approach under several factors, including dimensionality of the geometric space, peer distance distribution, and the number of peer-to-peer distance measurements used. We evaluate two PALM-based schemes: RAND-PALM and ISLAND. In RAND-PALM, a peer node randomly selects from existing peer nodes as its landmarks. In ISLAND (Intelligent Selection of Landmarks), each peer node selects its landmarks by exploiting the topological information derived based on existing peer nodes’ coordinates values.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory

The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...

متن کامل

Predicting Internet Network Distance with Coordinates-Based Approaches

In this paper, we propose to use coordinates-based mechanisms in a peer-to-peer architecture to predict Internet network distance (i.e. round-trip propagation and transmission delay). We study two mechanisms. The first is a previously proposed scheme, called the triangulated heuristic, which is based on relative coordinates that are simply the distances from a host to some special network nodes...

متن کامل

A Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory

The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...

متن کامل

Estimation of network distances using off-line measurements

Several emerging large-scale Internet applications such as Content Distribution Networks, and Peer-to-Peer networks could potentially benefit from knowing the underlying Internet topology and the distances (i.e., round-trip-time) between different hosts. Most existing techniques for distance estimation either use a dedicated infrastructure or use on-line measurements in which probe packets are ...

متن کامل

P2P Network Trust Management Survey

Peer-to-peer applications (P2P) are no longer limited to home users, and start being accepted in academic and corporate environments. While file sharing and instant messaging applications are the most traditional examples, they are no longer the only ones benefiting from the potential advantages of P2P networks. For example, network file storage, data transmission, distributed computing, and co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003